Tarskian Semantics, or No Notation Without Denotation!

نویسنده

  • Drew McDermott
چکیده

Tarskian semantics is called "Tarskian" for historical reasons (Tarski, 1936). A more descriptive name would be "systematic denotational semantics," or SD for short. The method is called "denotational" because it specified the meanings of a notation in terms of what its expressions denote. The method is called "systematic" in hopes that the rules that assign meaning are precise enough to support statements and occasionally proofs of interesting properties of the notation. In a typical predicate calculus, we assign to primitive symbols denotations which consist of objects, functions, or predicates. Then the meanings of more complex expressions are defined by rules which define their meanings in terms of the meanings of their parts. For sentences in such a language, this amounts to specifying the conditions which make any given sentence true. That is, the meaning of a sentence is a specification of what would make it denote T and what would make it denote NIL. This specification may thus be thought of as a generalization of an ordinary LISP predicate definition. For example, we may assign to the predicate symbol PTRANS a predicate which is true only if its first argument has ever caused its second argument to be physically transferred from its third argument to its fourth argument. Then the denotation of (ACTOR x ¢=~ PTRANS OBJ y FROM u TO v) should be T just if the denotation of x has ever transferred the denotation of y from the denotation of u to the denotation of v. (This is a long-winded way of writing a typical semantic rule, which maps the syntax of an expression into a denotation systematically. Syntax is not an issue in this paper, but notice that the use of SD does not commit us to any syntax in particular, so long as it is precise.) It is clear that the first argument of the denotation of PTRANS should be an animate agent; its second, a physical object; its third and fourth, places. If we wish to be precise, we must somehow forbid incongruous types to appear in these places, or go on to specify what the denotation (ACTOR x ¢e~ PTRANS OBJ y FROM u TO v) is when x, y, u, or v is incongruous. So far this may seem very fluffy stuff. What have we gained by (apparently) just repeating in the semantic domain what is fairly obvious in the first place? Mainly …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Notions to Models and Back Again, Again

A typical thread in research relies on the maturing of ideasthrough an iterative process of construction, testing and refinement.In this talk I will trace some such trajectories of ideas by illustrationfrom some of my own and others’ experiences in agent-based modelling.I draw inspiration from previous commentaries, including from thosewho generated the mottos: “No Notation ...

متن کامل

Tarski, Truth, and Semantics

No one denies that Tarski made a major contribution to one particular problem about truth, namely, the resolution of the semantic paradoxes—although, of course, there is disagreement about whether he provided the correct solution. But some philosophers have suggested that Tarski also made a significant contribution to another project, that of providing semantic theories for natural languages. H...

متن کامل

Computational Semantics with Functional Programming

ing from the domain of discourse, we can say that determiner interpretations (henceforth simply called determiners) pick out binary relations on sets of individuals, on arbitrary domains of discourse E. The notation is DEAB. We call A the restriction of the quantifier and B its body. If DEAB is the translation of a simple sentence consisting of a quantified noun phrase with an intransitive verb...

متن کامل

rticles RUSSELL ON “DISAMBIGUATING WITH THE GRAIN”

Fregeans face the difficulty finding a notation for distinguishing statements about the sense or meaning of an expression as opposed to its reference or denotation. Famously, in “On Denoting”, Russell rejected methods that begin with an expression designating its denotation, and then alter it with a “the meaning of ” operator to designate the meaning. Such methods attempt an impossible “backwar...

متن کامل

Compositionality Properties of SLD-Derivations

The paper introduces a semantics for definite logic programs expressed in term of SLD-derivations and studies various properties of SLD-derivations by using the above semantics. The semantics of a program is a goal-independent denotation, which can equivalently be specified by a denotational semantics and a transition system. The denotation is proved to be correct, minimal, AND-compositional an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Cognitive Science

دوره 2  شماره 

صفحات  -

تاریخ انتشار 1978